Action Languages, Answer Sets and Planning

نویسنده

  • Vladimir Lifschitz
چکیده

This is a discussion of some of the achievements and challenges related to representing actions and the design of planners from the perspective of logic programming. We talk about recent work on action languages and translating them into logic programming, on representing possible histories of an action domain by answer sets, on eecient implementations of the answer set semantics and their use for generating plans, and on causal logic and its relation to planning algorithms. Recent progress in these areas may lead to the creation of planners which are based on the ideas of logic programming and combine the use of expressive action description languages with eecient computational procedures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about Actions in Fuzzy Environment

Reasoning in the presence of imprecision and vagueness is inevitable in many real-world applications including those in robotics and intelligent agents. Although, reasoning about actions is a major component in these real-world applications, current actions languages for reasoning about actions lack the ability to represent and reason about actions in the presence of imprecision and vagueness t...

متن کامل

Planning with Action Languages: Perspectives using CLP(FD) and ASP

Action description languages, such as A and B (Gelfond and Lifschitz, 1998), are expressive tools introduced for formalizing planning domains and problems. In this work, we investigate two alternative approaches to the problem of encoding action languages using logic programming. Starting from a slight variation of B, we explore the use of Answer Set Programming (ASP) and Constraint Logic Progr...

متن کامل

Applications of Answer Set Programming

tation and reasoning (KR) paradigm. It has rich highlevel representation languages that allow recursive definitions, aggregates, weight constraints, optimization statements, default negation, and external atoms. With such expressive languages, ASP can be used to declaratively represent knowledge (for example, mathematical models of problems, behaviour of dynamic systems, beliefs and actions of ...

متن کامل

Planning and Scheduling in Hybrid Domains Using Answer Set Programming

In this paper we present an Action Language-Answer Set Programming based approach to solving planning and scheduling problems in hybrid domains domains that exhibit both discrete and continuous behavior. We use action language H to represent the domain and then translate the resulting theory into an A-Prolog program. In this way, we reduce the problem of finding solutions to planning and schedu...

متن کامل

Characterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action Languages B, C, and Beyond

We consider a simple language for writing causal action theories, and postulate several properties for the state transition models of these theories. We then consider some possible embeddings of these causal action theories in some other action formalisms, and their implementations in logic programs with answer set semantics. In particular, we propose to consider what we call permissible transl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999